Recent advances on two-dimensional bin packing problems

Recent advances on two-dimensional bin packing problems

We survey recent advances obtained for the two-dimensional bin packing problem, with special emphasis on exact algorithms and e1ective heuristic and metaheuristic approaches. ? 2002 Elsevier Science B.V. All rights reserved.

Recent Advances in Multi-Dimensional Packing Problems

Packing problems have been much studied in the past decades due, in particular, to their wide range of applications in many settings of theoretical and practical interest, including packing/loading, scheduling, and routing. We focus onMulti-Dimensional Packing problems, which present specific methodological challenges while also being of particular interest to transportation and modern supply c...

Algorithms for Two-Dimensional Bin Packing and Assignment Problems

Two-Dimensional On-Line Bin Packing Problem with Rotatable Items

In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is “rotatable” by 90 ◦ . Two on-line algorithms for solving the problem are proposed. The second algorithm is an extension of the 2rst algorithm, and the worst-case ratio of the second one is at least 2.25 and at most 2.565. c © 2002...

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...